Solving the Traveling Salesman Problem: A Modified Metaheuristic Algorithm

The traveling salesman problem (TSP) is one of the most important issues in combinatorial optimization problems that are used many engineering sciences and has attracted attention scientists researchers. In this issue, a starts to move from desired node called warehouse returns starting place after meeting n customers provided each customer only met once. aim issue determine cycle with minimum cost for salesman. One major weaknesses PSO algorithm classical version it gets stuck local optimizations. Therefore, proposed algorithm, MPSO, best solution current iteration also movement step. addition, variety search algorithms when better answers generated than before. Also, new method moving particle towards presented, which, addition probably increasing quality answer, prevents premature convergence due consideration concept random. results evaluated several metaheuristic literature show efficiency MPSO because been able achieve excellent solutions these instances.